Overdetermined harmonic polynomial interpolation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overdetermined Systems of Sparse Polynomial Equations

We show that, for a system of univariate polynomials given in the sparse encoding, we can compute a single polynomial de ning the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine if such a system of polynomials does have a zero in time quasi-linear in the logarithm of the degree. The underlying algorithm relies on a result of Bombier...

متن کامل

Polynomial Interpolation

Consider a family of functions of a single variable x: Φ(x; a0, a1, . . . , an), where a0, . . . , an are the parameters. The problem of interpolation for Φ can be stated as follows: Given n + 1 real or complex pairs of numbers (xi, fi), i = 0, . . . , n, with xi 6= xk for i 6= k, determine a0, . . . , an such that Φ(xi; a0, . . . , an) = fi, i = 0, . . . , n. The above is a linear interpolatio...

متن کامل

Subdivision Invariant Polynomial Interpolation

In previous works a polynomial interpolation method for triangular meshes has been introduced. This interpolant can be used to design smooth surfaces of arbitrary topological type. In a design process, it is very useful to be able to locate the deformation made on a geometric model. The previously introduced interpolant has the so-called strict locality property: when a mesh vertex is changed, ...

متن کامل

On partial polynomial interpolation

The Alexander-Hirschowitz theorem says that a general collection of k double points in P imposes independent conditions on homogeneous polynomials of degree d with a well known list of exceptions. We generalize this theorem to arbitrary zero-dimensional schemes contained in a general union of double points. We work in the polynomial interpolation setting. In this framework our main result says ...

متن کامل

On multivariate polynomial interpolation

We provide a map Θ 7→ ΠΘ which associates each finite set Θ of points in C with a polynomial space ΠΘ from which interpolation to arbitrary data given at the points in Θ is possible and uniquely so. Among all polynomial spaces Q from which interpolation at Θ is uniquely possible, our ΠΘ is of smallest degree. It is also Dand scale-invariant. Our map is monotone, thus providing a Newton form for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1972

ISSN: 0021-9045

DOI: 10.1016/0021-9045(72)90037-8